Communicative Approximations as Rough Sets
نویسندگان
چکیده
Introduction: Communicative approximations are equivalence relations. For considering Communicative approximation, new constructs are necessary including “rough points” and “rough intervals”. “Communication about quantities is defined on a shared conventional space, which constitutes a tessellation on the real number line”. The uncertainty which results from measurement error (±η) is defined on a tolerance approximation spate whereas error reflected in communication (€) is defined on the communicative approximation space. In order to avoid a false impression of greater precision we assume that € ≥ ±η. The worst case arises when €=±η. The approximation space is defined as the domain of discourse, together with an equivalence relation on it.
منابع مشابه
A Note on Definability and Approximations
Definability and approximations are two important notions of the theory of rough sets. In many studies, one is used to define the other. There is a lack of an explicit interpretation of the physical meaning of definability. In this paper, the definability is used as a more primitive notion, interpreted in terms of formulas of a logic language. A set is definable if there is a formula that defin...
متن کاملTopological Interpretation of Rough Sets
Rough sets, developed by Pawlak, are an important model of incomplete or partially known information. In this article, which is essentially a continuation of [11], we characterize rough sets in terms of topological closure and interior, as the approximations have the properties of the Kuratowski operators. We decided to merge topological spaces with tolerance approximation spaces. As a testbed ...
متن کاملIncremental updating approximations in probabilistic rough sets under the variation of attributes
The attribute set in an information system evolves in time when new information arrives. Both lower and upper approximations of a concept will change dynamically when attributes vary. Inspired by the former incremental algorithm in Pawlak rough sets, this paper focuses on new strategies of dynamically updating approximations in probabilistic rough sets and investigates four propositions of upda...
متن کاملFuzzy-Rough Nearest Neighbour Classification
A new fuzzy-rough nearest neighbour (FRNN) classification algorithm is presented in this paper, as an alternative to Sarkar’s fuzzyrough ownership function (FRNN-O) approach. By contrast to the latter, our method uses the nearest neighbours to construct lower and upper approximations of decision classes, and classifies test instances based on their membership to these approximations. In the exp...
متن کاملTwo views of the theory of rough sets in finite universes
This paper presents and compares two views of the theory of rough sets. The operator-oriented view interprets rough set theory as an extension of set theory with two additional unary operators. Under such a view, lower and upper approximations are related to the interior and closure operators in topological spaces, the necessity and possibility operators in modal logic, and lower and upper appr...
متن کامل